全文获取类型
收费全文 | 816篇 |
免费 | 61篇 |
国内免费 | 76篇 |
专业分类
化学 | 177篇 |
晶体学 | 2篇 |
力学 | 19篇 |
综合类 | 31篇 |
数学 | 634篇 |
物理学 | 90篇 |
出版年
2023年 | 3篇 |
2022年 | 6篇 |
2021年 | 20篇 |
2020年 | 12篇 |
2019年 | 17篇 |
2018年 | 24篇 |
2017年 | 28篇 |
2016年 | 33篇 |
2015年 | 22篇 |
2014年 | 55篇 |
2013年 | 47篇 |
2012年 | 48篇 |
2011年 | 49篇 |
2010年 | 41篇 |
2009年 | 43篇 |
2008年 | 44篇 |
2007年 | 44篇 |
2006年 | 56篇 |
2005年 | 40篇 |
2004年 | 40篇 |
2003年 | 43篇 |
2002年 | 26篇 |
2001年 | 25篇 |
2000年 | 31篇 |
1999年 | 20篇 |
1998年 | 21篇 |
1997年 | 18篇 |
1996年 | 18篇 |
1995年 | 8篇 |
1994年 | 15篇 |
1993年 | 8篇 |
1992年 | 4篇 |
1991年 | 8篇 |
1990年 | 4篇 |
1988年 | 4篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 4篇 |
1979年 | 4篇 |
1978年 | 1篇 |
排序方式: 共有953条查询结果,搜索用时 32 毫秒
101.
Joël Benoist 《Journal of Global Optimization》2003,25(3):321-335
In finite dimensional Euclidean space, we prove the contractibility of the efficient frontier of simply shaded sets. This work extends the result of Peleg [7], which confirms the contractibility of the efficient frontier in the convex case. 相似文献
102.
利用集值映射不动点定理及最优化问题与变分不等式的关系给出线性G^↑ateaux可微的锥凸映射的广义有效点的一个存在性定理。 相似文献
103.
本文给出多目标规划有效解适应鞍点准则的一个新的判别法 ,它不使用凸性的几何术语及凸分析中的概念。最后给出单目标规划的一个相应的判别法 相似文献
104.
On the existence of efficient points in locally convex spaces 总被引:1,自引:0,他引:1
Truong Xuan Duc Ha 《Journal of Global Optimization》1994,4(3):265-278
We study the existence of efficient points in a locally convex space ordered by a convex cone. New conditions are imposed on the ordering cone such that for a set which is closed and bounded in the usual sense or with respect to the cone, the set of efficient points is nonempty and the domination property holds. 相似文献
105.
G. J. Zalmai 《Journal of Optimization Theory and Applications》1996,90(2):435-456
We establish necessary and sufficient conditions for properly efficient solutions of a class of nonsmooth nonconvex optimal control problems with multiple fractional objective functions, linear dynamics, and nonlinear inequality constraints on both the state and control variables. Subsequently, we utilize these proper efficiency criteria to construct two multiobjective dual problems and prove appropriate duality theorems. Also, we specialize and discuss these results for a particular case of our principal problem which contains square roots of positivesemidefinite quadratic forms. As special cases of the main proper efficiency and duality results, this paper also contains similar results for control problems with multiple, fractional, and ordinary objective functions. 相似文献
106.
Luc G. Chalmet Richard L. Francis Antoon Kolen 《European Journal of Operational Research》1981,6(2):117-124
Given n planar existing facility locations, a planar new facility location X is called efficient if there is no other location Y for which the rectilinear distance between Y and each existing facility is at least as small as between X and each existing facility, and strictly less for at least one existing facility. Rectilinear distances are typically used to measure travel distances between points via rectilinear aisles or street networks. We first present a simple arrow algorithm, based entirely on geometrical analysis, that constructs all efficient locations. We then present a row algorithm which is of order n(log n) that constructs all efficient locations, and establish that no alternative algorithm can be of a lower order. 相似文献
107.
108.
Let (P) denote the vector maximization problem
where the objective functions f
i
are strictly quasiconcave and continuous on the feasible domain D, which is a closed and convex subset of R
n
. We prove that if the efficient solution set E(P) of (P) is closed, disconnected, and it has finitely many (connected) components, then all the components are unbounded. A similar fact is also valid for the weakly efficient solution set E
w
(P) of (P). Especially, if f
i
(i=1,...,m) are linear fractional functions and D is a polyhedral convex set, then each component of E
w
(P) must be unbounded whenever E
w
(P) is disconnected. From the results and a result of Choo and Atkins [J. Optim. Theory Appl. 36, 203–220 (1982.)] it follows that the number of components in the efficient solution set of a bicriteria linear fractional vector optimization problem cannot exceed the number of unbounded pseudo-faces of D. 相似文献
109.
The properness of the efficient solution of the optimal problem with multicriteria has been independently defined by Kuhn and Tucker, Geoffrion, and Klinger. A theorem of Geoffrion describes the relation between Geoffrion's and Kuhn and Tucker's properness. In this paper, the dual part of the theorem is given, and some geometric approach is applied to derive the optimal conditions of proper efficient solutions and improper efficient solutions. 相似文献
110.
H. P. Benson 《Journal of Optimization Theory and Applications》1982,38(3):341-361
In this paper, we present several new properties of the admissible points of a convex polyhedron. These properties can be classified into two categories. One category concerns the characterization and generation of these points. The other category concerns the circumstances under which these points are efficient solutions for linear multiple-objective programs with nonnegative criteria matrices. To illustrate some of the potential utility of these properties, we describe their application to two practical problems. These problems are the linear multiple-objective problem with interval coefficients and the problem of optimizing over the efficient set.This research was supported, in part, by the Center for Econometrics and Decision Sciences, University of Florida, Gainesville, Florida. 相似文献